Timewise Refinement for Communicating Processes
نویسنده
چکیده
A theory of timewise reenement is presented. This allows the translation of speciications and proofs of correctness between semantic models, permitting each stage in the veriication of a system to take place at the appropriate level of abstraction. The theory is presented within the context of CSP. A denotational characterisation of reenement is given in terms of relations between behaviours at diierent levels of abstraction. Various properties for the preservation of reenement through parallel composition are discussed. An operational characterisation is also given in terms of timed and untimed tests, and observed to coincide with the denotational characterisation.
منابع مشابه
The automated verification of timewise refinement (Draft)
While Hoare’s CSP models reactive systems without assigning an exact time to events, Timed CSP records the exact times as nonnegative reals. Timed CSP therefore provides a more exact semantics of systems, but it still makes sense to ask whether a timed process satisfies an untimed specification. Indeed the question of whether such specifications are satisfied often reduces to the timing details...
متن کاملA Reasoning Method for Timed CSP Based on Constraint Solving
Timed CSP extends CSP by introducing a capability to quantify temporal aspects of sequencing and synchronization. It is a powerful language to model real time reactive systems. However, there is no verification tool support for proving critical properties over systems modelled using Timed CSP. In this work, we construct a reasoning method using Constraint Logic Programming (CLP) as an underlyin...
متن کاملTimewise Re nement for Communicating Processes
A theory of timewise re nement is presented This allows the translation of speci cations and proofs of correctness between semantic models permitting each stage in the veri cation of a system to take place at the appropriate level of abstraction The theory is presented within the context of CSP A denotational characterisation of re nement is given in terms of relations between behaviours at di ...
متن کاملDevelopment of an ML-based Verification Tool for Timed CSP Processes
We report the development of a verification tool for Timed CSP processes. The tool has been built on the functional programming language ML. The tool interprets processes described in both timed and untimed CSP, converting them to ML functions, and executing those functions for the verification of refinement in the timed traces and timewise traces models. Using the programmability of higher ord...
متن کاملA Process Algebraic Approach to Decomposition of Communicating SysML Blocks
The block concept is a fundamental modelling construct in the Systems Modeling Language (SysML), a visual modelling language for systems engineering applications. In a top-down systems engineering approach, an abstract block is decomposed into concrete communicating sub-blocks. However, the classifier behaviour of the abstract block must be exhibited by the composition of the concrete sub-block...
متن کامل